hierarchical computation of hermite spherical interpolant
نویسندگان
چکیده
in this paper, we propose to extend the hierarchical bivariatehermite interpolant to the spherical case. let $t$ be an arbitraryspherical triangle of the unit sphere $s$ and let $u$ be a functiondefined over the triangle $t$. for $kin mathbb{n}$, we consider ahermite spherical interpolant problem $h_k$ defined by some datascheme $mathcal{d}_k(u)$ and which admits a unique solution $p_k$in the space $b_{n_k}(t)$ of homogeneous bernstein-b'ezierpolynomials of degree $n_k=2k$ (resp. $n_k=2k+1$) defined on $t$. wediscuss the case when the data scheme $mathcal{d}_{r}(u)$ arenested, i.e., $mathcal{d}_{r-1}(u)subset mathcal{d}_{r}(u)$ forall $1 leq r leq k$. this, give a recursive formulae to computethe polynomial $p_k$. moreover, this decomposition give a new basisfor the space $b_{n_k}(t)$, which are the hierarchical structure.the method is illustrated by a simple numerical example.
منابع مشابه
HIERARCHICAL COMPUTATION OF HERMITE SPHERICAL INTERPOLANT
In this paper, we propose to extend the hierarchical bivariateHermite Interpolant to the spherical case. Let $T$ be an arbitraryspherical triangle of the unit sphere $S$ and let $u$ be a functiondefined over the triangle $T$. For $kin mathbb{N}$, we consider aHermite spherical Interpolant problem $H_k$ defined by some datascheme $mathcal{D}_k(u)$ and which admits a unique solution $p_k$in the ...
متن کاملMultivariate refinable Hermite interpolant
We introduce a general definition of refinable Hermite interpolants and investigate their general properties. We also study a notion of symmetry of these refinable interpolants. Results and ideas from the extensive theory of general refinement equations are applied to obtain results on refinable Hermite interpolants. The theory developed here is constructive and yields an easyto-use constructio...
متن کاملHermite approximation for offset curve computation
The present paper proposes a new method for calculating the Gcontinuous o set curve to a cubic B ezier curve, based on the Hermite approximation technique. This method is improved by preliminary curvature estimation and is intended for use in cpu-time sensitive CAGD applications.
متن کاملHermite Expansions in Monte-Carlo Computation*
Monte-Carlo computations often yield numerical answers of limited accuracy, and are therefore employed as a last resort. It has been found, however, that some of the limitations of Monte-Carlo methods can be overcome through a judicious use of orthogonal expansions. When a numerical answer is obtained as the expected value of an estimator, expansion of that estimator in a series of orthogonal f...
متن کاملFast Computation of Hermite Normal Forms of Random Integer Matrices
This paper is about how to compute the Hermite normal form of a random integer matrix in practice. We propose significant improvements to the algorithm by Micciancio and Warinschi, and extend these techniques to the computation of the saturation of a matrix. Tables of timings confirm the efficiency of this approach. To our knowledge, our implementation is the fastest implementation for computin...
متن کاملHermite form computation of matrices of di erential polynomials
Given a matrix A ∈ F(t)[D; δ]n×n over the ring of di erential polynomials, we rst prove the existence of the Hermite form H of A over this ring. Then we determine degree bounds on U and H such that UA = H. Finally, based on the degree bounds on U and H, we compute the Hermite form H of A by reducing the problem to solving a linear system of equations over F(t). The algorithm requires a polynomi...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
international journal of mathematical modelling and computationsجلد ۲، شماره ۴ (FALL)، صفحات ۲۴۷-۲۵۹
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023